A Category-Based Equational Logic Semantics to Constraint Programming

نویسنده

  • Razvan Diaconescu
چکیده

This paper exploits the point of view of constraint programming as computation in a logical system, namely constraint logic. We dene the basic ingredients of constraint logic, such as constraint models and generalised polynomials. We show that constraint logic is an institution , and we internalise the study of constraint logic to the framework of category-based equational logic. By showing that constraint logic is a special case of category-based equational logic, we integrate the constraint logic programming paradigm into equational logic programming. Results include a Herbrand theorem for constraint logic programming characterising Herbrand models as initial models in constraint logic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Category-based constraint logic

This research exploits the view of constraint programming as computation in a logical system, namely constraint logic. The basic ingredients of constraint logic are: constraint models for the semantics (they form a comma-category over a fixed model of “built-ins”), generalized polynomials in the rôle of basic syntactic ingredient, and a constraint satisfaction relation between semantics and syn...

متن کامل

Category-based Semantics for Equational and Constraint Logic Programming

This thesis proposes a general framework for equational logic programming, called catf:gory­ based equational logic by placing the general principles underlying the design of the pro­ gramming language Eqlog and formulated by Goguen and Meseguer into an abstract form. This framework generalises equational deduction to an arbitrary category satisfy­ ing certain natural conditions; completeness i...

متن کامل

Category-based Semantic Paramodulation

We introduce the concept of semantic paramodulation as a \semantic" de nition of paramodulation (in the sense that it applies to any model, not only to the term algebra) within the framework of category-based equational logic (introduced by [8, 9]). This not only generalises the traditional syntactic approaches to paramodulation, but also provides an abstract framework for a uni ed treatment of...

متن کامل

Completeness of Category-Based Equational Deduction

Equational deduction is generalised within a category-based abstract model theory framework, and proved complete under a hypothesis of quantiier projectivity, using a semantic treatment that regards quantiiers as models rather than variables, and regards valuations as model morphisms rather than functions. Applications include many and order sorted conditional] equational logics, Horn clause lo...

متن کامل

The Semantics of Equational Logic Programming as an instance of CLP

This work was supported by ESPRIT Basic Research Action P3020 \Integration", by CICYT under grant TIC 91-0425, and by \Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo of C.N.R." under grant n.9100880.PF69 Departamento de Sistemas Inform aticos y Computaci on, Universidad Polit ecnica de Valencia, Camino de Vera s/n, Apdo. 22012, 46020 Valencia, Spain. Dipartimento di Informatica, U...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995